Tags: #◇Computer Science #◇STT101A #◇Conceptual #◇Probability Mass Function
◇Overview
The Probability Mass Function (PMF) of a discrete random variable , denoted or , assigns a probability mass to each possible discrete value in the support .
◇Key Definitions
- PMF Definition: for .
- Support (): The countable set of values with strictly positive probability: .
- Two Defining Axioms of a Valid PMF:
- Non-negativity: for all .
- Normalization (Sums to 1): .
- Relation to CDF : , and for ordered support , .
◇Worked Example
Problem: Verify that for is a valid PMF, and compute .
Solution:
- Non-negative: for each .
- Sum: . (Valid PMF!)
- .
◇References & Navigation
- Previous Topic: ◇Discrete Probability Distribution
- Next Topic: ◇Hyper-geometric Distribution
- Related Notes: ◇Normal Distribution, ◇Random Variables
ACTIVE RECALL VERIFICATION
Select an answer to verify conceptual comprehension and reveal the technical rationale.
Which two conditions are both necessary and sufficient for a function on a countable set to be a valid Probability Mass Function (PMF)?
Let have PMF for . What must the constant equal?
How can you recover the PMF value at a jump point from the Cumulative Distribution Function ?
What is the PMF of a Poisson random variable for ?
Why do we use a Probability Mass Function (PMF) for discrete random variables, whereas continuous random variables require a Probability Density Function (PDF)?